Quantum Convolution of Linearly Recursive Sequences
نویسندگان
چکیده
منابع مشابه
Linearly Unrelated Sequences
There are not many new results concerning the linear independence of numbers. Exceptions in the last decade are, e.g., the result of Sorokin [8] which proves the linear independence of logarithmus of special rational numbers, or that of Bezivin [2] which proves linear independence of roots of special functional equations. The algebraic independence of numbers can be considered as a generalizati...
متن کاملFibonacci Convolution Sequences
(1-2) F<„'> £ FWFi , 1=0 However, there are some easier methods of calculation. Let the Fibonacci polynomials Fn(x) be defined by (1.3) Fn+2(x) = xFn+1(x) + Fn(x), Fo(x)~0, F7(x) = 1 . Then, since Fn(1)= Fn, the recursion relation for the Fibonacci numbers, Fn+2= Fn+i + Fn, follows immediately by taking x = I In a similar manner we may write recursion relations for {Fff^} . From (1.3), taking t...
متن کاملLinearly positive histories: Probabilities for a robust family of sequences of quantum events.
Nonnegative probabilities that obey the sum rules may be assigned to a much wider family of sets of histories than decohering histories. The resulting linearly positive histories avoid the highly restrictive decoherence conditions and yet give the same probabilities when those conditions apply. Thus linearly positive histories are a broad extension of decohering histories. Moreover, the resulti...
متن کاملConvergence of Sequences of Convolution Operators
When (φn) is a sequence of positive functions in L1(R) such that the convolutions φn ? f converge in L1-norm to f for all f ∈ L1(R), then these convolutions may or may not converge almost everywhere too. There is always a subsequence (φnk ) such that at least φnk ? f converges almost everywhere to f for all f ∈ Lp(R), 1 < p < ∞. A special case of this is when the functions φn are the dilations ...
متن کاملRecursive Binary Sequences of Differences
A wide variety of problems exist requiring the identification of the best binary sequence from a choice of many. For example, consider the fairest way for “captain A” and “captain B” to choose sides for a pickup game of basketball. It is traditional to alternate choices and if eight other players are available, captain A gets the first, third, fifth, and seventh choices, while captain B gets th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algebra
سال: 1997
ISSN: 0021-8693
DOI: 10.1006/jabr.1997.7143